Abduction in Annotated Probabilistic Temporal Logic
نویسندگان
چکیده
Annotated Probabilistic Temporal (APT) logic programs are a form of logic programs that allow users to state (or systems to automatically learn) rules of the form “formula G becomes true K time units after formula F became true with L to U% probability.” In this paper, we develop a theory of abduction for APT logic programs. Specifically, given an APT logic program Π, a set of formulas H that can be “added” to Π, and a goal G, is there a subset S of H such that Π ∪ S is consistent and entails the goal G? In this paper, we study the complexity of the Basic APT Abduction Problem (BAAP). We then leverage a geometric characterization of BAAP to suggest a set of pruning strategies when solving BAAP and use these intuitions to develop a sound and complete algorithm. 1998 ACM Subject Classification I.2.3 Logic Programming, Probabilistic Reasoning
منابع مشابه
Complexity of Temporal Query Abduction in DL-Lite
Temporal query abduction is the problem of hypothesizing a minimal set of temporal data which, given some fixed background knowledge, warrants the entailment of the query. This problem formally underlies a variety of forms of explanatory and diagnostic reasoning in the context of time series data, data streams, or otherwise temporally annotated structured information. In this paper, we consider...
متن کاملAbduction in PDT Logic
Probabilistic Doxastic Temporal (PDT) Logic is a formalism to represent and reason about belief evolutions in multi–agent systems. In this work we develop a theory of abduction for PDT Logic. This gives means to novel reasoning capabilities by determining which epistemic actions can be taken in order to induce an evolution of probabilistic beliefs into a desired goal state. Next to providing a ...
متن کاملPlan Projection as Deduction and Plan Generation as Abduction in a Context-sensitive Temporal Probability Logic
This paper presents a theoretical framework for representing plans in a context-sensitive temporal probability logic and for reasoning about plans by constructing Bayesian networks from these knowledge bases. We provide a sound and complete network construction algorithm for evaluating plans which uses context information to index only the relevant portions of the knowledge base. We formalize p...
متن کاملAn Abductive-Inductive Algorithm for Probabilistic Inductive Logic Programming
The integration of abduction and induction has lead to a variety of non-monotonic ILP systems. XHAIL is one of these systems, in which abduction is used to compute hypotheses that subsume Kernel Sets. On the other hand, Peircebayes is a recently proposed logic-based probabilistic programming approach that combines abduction with parameter learning to learn distributions of most likely explanati...
متن کاملAn Expressive Probabilistic Temporal Logic
This paper argues that a combined treatment of probabilities, time and actions is essential for an appropriate logical account of the notion of probability; and, based on this intuition, describes an expressive probabilistic temporal logic for reasoning about actions with uncertain outcomes. The logic is modal and higher-order : modalities annotated by actions are used to express possibility an...
متن کامل